Chemical Continuous Time Random Walks.

نویسندگان

  • Tomás Aquino
  • Marco Dentz
چکیده

Kinetic Monte Carlo methods such as the Gillespie algorithm model chemical reactions as random walks in particle number space. The interreaction times are exponentially distributed under the assumption that the system is well mixed. We introduce an arbitrary interreaction time distribution, which may account for the impact of incomplete mixing on chemical reactions, and in general stochastic reaction delay, which may represent the impact of extrinsic noise. This process defines an inhomogeneous continuous time random walk in particle number space, from which we derive a generalized chemical master equation. This leads naturally to a generalization of the Gillespie algorithm. Based on this formalism, we determine the modified chemical rate laws for different interreaction time distributions. This framework traces Michaelis-Menten-type kinetics back to finite-mean delay times, and predicts time-nonlocal macroscopic reaction kinetics as a consequence of broadly distributed delays. Non-Markovian kinetics exhibit weak ergodicity breaking and show key features of reactions under local nonequilibrium.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous-time random walks with internal dynamics and subdiffusive reaction-diffusion equations.

We formulate the generalized master equation for a class of continuous-time random walks in the presence of a prescribed deterministic evolution between successive transitions. This formulation is exemplified by means of an advection-diffusion and a jump-diffusion scheme. Based on this master equation, we also derive reaction-diffusion equations for subdiffusive chemical species, using a mean-f...

متن کامل

Refined estimates for some basic random walks on the symmetric and alternating groups

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups Sn and An. We consider the following models: random transposition, transpose top with random, random insertion, and walks generated by the uniform measure on a conjugacy class. In the case of random walks on Sn and An generated by the uniform measure on...

متن کامل

Continuous-time random walks at all times.

Continuous-time random walks (CTRW) play an important role in understanding of a wide range of phenomena. However, most theoretical studies of these models concentrate only on dynamics at long times. We present a new theoretical approach, based on generalized master equations picture, which allowed us to obtain explicit expressions for Laplace transforms for all dynamic quantities for different...

متن کامل

Discrete-time random walks on diagrams (graphs) with cycles.

After a review of the diagram method for continuous-time random walks on graphs with cycles, the method is extended to discrete-time random walks. The basic theorems carry over formally from continuous time to discrete time. Three problems in tennis probabilities are used to illustrate random walks on discrete-time diagrams with cycles.

متن کامل

Random Walks and Chemical Networks

We consider continuous-time random walks with bounded jumps but unbounded rates (they depend polynomially on coordinates in the orthant). In applications, the case when the rates are bounded corresponds in applications to queueing theory, more precisely, to Markovian communication networks. The goal of this paper is to discuss the situation for polynomial rates; we show that the boundaries ofte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review letters

دوره 119 23  شماره 

صفحات  -

تاریخ انتشار 2017